Predicting Fame and Fortune: PageRank or Indegree?

نویسندگان

  • Trystan Upstill
  • Nick Craswell
  • David Hawking
چکیده

Measures based on the Link Recommendation Assumption are hypothesised to help modern Web search engines rank ‘important, high quality’ pages ahead of relevant but less valuable pages and to reject ‘spam’. We tested these hypotheses using inlink counts and PageRank scores readily obtainable from search engines Google and Fast. We found that the average Google-reported PageRank of websites operated by Fortune 500 companies was approximately one point higher than the average for a large selection of companies. The same was true for Fortune Most Admired companies. A substantially bigger difference was observed in favour of companies with famous brands. Investigating less desirable biases, we found a one point bias toward technology companies, and a two point bias in favour of IT companies listed in the Wired 40. We found negligible bias in favour of US companies. Log of indegree was highly correlated with Google-reported PageRank scores, and just as effective when predicting desirable company attributes. Further, we found that PageRank scores for sites within a known spam network were no lower than would be expected on the basis of their indegree. We encounter no compelling evidence to support the use of PageRank over indegree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ranking nodes in growing networks: When PageRank fails – Supplementary Information

S1 Temporal decay of the average relevance r(t) and activity a(t) in Digg.com social network 5 S2 Temporal decay of the average relevance r(t) in the APS dataset . . . . . . . . . . . . 5 S3 Age distribution of the top 1% nodes in the ranking (APS data and the corresponding calibrated simulation) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 S4 Outdegree distribution...

متن کامل

Pinpointing Influence in Pinterest

The success of most applications that run on top of a social network infrastructure is due to the social ties among their users; the users can get informed about the activity of their friends and acquaintances, and, hence, new ideas, habits, and products have the opportunity to gain popularity. Therefore, understanding the influence dynamics on social networks provides us with insights that are...

متن کامل

A Hypergraph Model for Computing Page Reputation on Web Collections

In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets of pages. In our model, the web hypergraph is derived from the web graph by dividing the set of pages into non-overlapping blocks and using the links between pages of distinct blocks to create hyperarcs. Each hyperarc ...

متن کامل

Modeling the web as a hypergraph to compute page reputation

In this work we propose a model to represent the web as a directed hypergraph (instead of a graph), where links connect pairs of disjointed sets of pages. The web hypergraph is derived from the web graph by dividing the set of pages into non-overlapping blocks and using the links between pages of distinct blocks to create hyperarcs. A hyperarc connects a block of pages to a single page, in orde...

متن کامل

The 2000 Dexter Award Address Celebrity Culture in Parisian Chemistry

Even if some allow themselves to be defeated through lack of perseverance, there are others, and more than one would think, who attain prosperity, fortune, and, what is perhaps even preferable to these, celebrity. ... This is the case with the man whom we have just lost, and whom I make bold to call my pupil; for, issuing from my apothecary laboratory, he grew, found fame, and became a celebrity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003